Learning with mitigating random consistency from the accuracy measure
نویسندگان
چکیده
منابع مشابه
Improving Genetic Programming with Behavioral Consistency Measure
Program synthesis tasks usually specify only the desired output of a program and do not state any expectations about its internal behavior. The intermediate execution states reached by a running program can be nonetheless deemed as more or less preferred according to their information content with respect to the desired output. In this paper, a consistency measure is proposed that implements th...
متن کاملMitigating Unwanted Biases with Adversarial Learning
Machine learning is a tool for building models that accurately represent input training data. When undesired biases concerning demographic groups are in the training data, well-trained models will reflect those biases. We present a framework for mitigating such biases by including a variable for the group of interest and simultaneously learning a predictor and an adversary. The input to the net...
متن کاملAUC: A Better Measure than Accuracy in Comparing Learning Algorithms
Predictive accuracy has been widely used as the main criterion for comparing the predictive ability of classiication systems (such as C4.5, neural networks, and Naive Bayes). Most of these classiiers also produce probability estimations of the classiication, but they are completely ignored in the accuracy measure. This is often taken for granted because both training and testing sets only provi...
متن کاملDeriving fundamental measure theory from the virial series: consistency with the zero-dimensional limit.
Fundamental measure theory (FMT) for hard particles has great potential for predicting the phase behavior of colloidal and nanometric shapes. The modern versions of FMT are usually derived from the zero-dimensional limit, a system of at most one particle confined in a collection of cavities in the limit that all cavities shrink to the size of the particle. In Phys. Rev. E 85, 041150 (2012), a d...
متن کاملConsistency of Random Forests
Random forests are a learning algorithm proposed by Breiman (2001) which combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical performance, little is known about the mathematical properties of the procedure. This disparity between theory and practice originates in the difficulty to simultaneously analyze both t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2020
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-020-05914-3